Elementary Tree Representation
نویسندگان
چکیده
Most of the parsers deened for TAG (Tree Adjoining Grammar) formalism are based in classical CFG (Context-Free Grammar) parsers. An elementary tree is considered a set of CFG-rules and adjunction operation is simulated by substitution. Additional control considerations must be added in order to establish the real power of TAGs. In this paper, we present one elementary tree representation for TAG (plain representation). This representation is compared with respect to other (multilayer representation) that is commonly used in the literature in the deenition of TAG parsers.
منابع مشابه
LTAG Semantics of Focus
This paper presents LTAG semantics of focus and focus-sensitive quantifiers which adopts alternative semantics of focus (Rooth 1985 and subsequent work). It proposes that focused lexical items make its contribution at the level of elementary trees, so that each elementary tree is associated with two semantic representations: its ordinary semantic representation and its focus representation. Bas...
متن کاملA New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining
Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...
متن کاملSubdivision Tree Representation of Arbitrary Triangle Meshes
We investigate a new way to represent arbitrary triangle meshes. We prove that a large class of triangle meshes, called normal triangle meshes, can be represented by a subdivision tree, where each subdivision is one of four elementary subdivision types. We also show how to partition an arbitrary triangle mesh into a small set of normal meshes. The subdivision tree representation can be used to ...
متن کاملTree Adjoining Grammars in a Fragment of the Lambek Calculus
This paper presents a logical formalization of Tree Adjoining Grammar (TAG). TAG deals with lexicalized trees and two operations are available: substitution and adjunction. Adjunction is generally presented as an insertion of one tree inside another, surrounding the subtree at the adjunction node. This seems to contradict standard logical ability. We prove that some logical formalisms, namely a...
متن کاملTree-adjoining Grammars for Optimality Theory Syntax
This paper explores an optimality-theoretic approach to syntax based on Tree-Adjoining Grammars (TAG), where two separate optimizations are responsible for the construction of local pieces of tree structure (elementary trees) and the combination of these pieces of structure. The local optimization takes a non-recursive predicate-argument structure (PA-chunk) as an underlying representation and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998